Efficient Mining of Association Rules Based on Formal Concept Analysis
نویسندگان
چکیده
Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, Titanic, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.
منابع مشابه
A new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملEfficient Web Usage Mining Based on Formal Concept Analysis
Web usage mining attempts to discover useful knowledge from the secondary data obtained from the interactions of the users with the web. Web usage mining has become very critical for effective web site management, creating adaptive web sites, business and support services, personalization and so on. Web usage mining aims to discover interesting user access patterns from web logs. Formal Based C...
متن کاملIncremental Discovering Association Rules: A Concept Lattice Approach
Concept lattice is an efficient tool for data analysis. Mining association rules is a important subfield of data mining. In this paper we investigate the ability of concept lattice on associate rules and present an efficient algorithm which generate the large itemsets incrementally on the basis of Godin’s work.
متن کاملOptimal Rule Selection Scheme using Concept Relationship Analysis
In Data Mining, the Association rule mining is used to retrieve the recurrent item sets. Apriori algorithm is mainly used to mine association rules. In that, rule reduction is required for efficient decision-making system. Knowledge based rule reduction schemes are used to filter the interested rules. In the existing system rule validation is not provided. Quantitative attributes are not consid...
متن کاملMining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient thanmining frequent itemsets for generating non-redundant association rules. The task is challenging in data stream environment because of the unbounded nature and no-second-look characteristics. In this paper, we propose an algorithm, CLICI, for mining all recent closed itemsets in landmark window model of online data strea...
متن کامل